A Markov Chain Based Hierarchical Algorithm for Fabric-Aware Capacitance Extraction
نویسندگان
چکیده
منابع مشابه
analysis of ruin probability for insurance companies using markov chain
در این پایان نامه نشان داده ایم که چگونه می توان مدل ریسک بیمه ای اسپیرر اندرسون را به کمک زنجیره های مارکوف تعریف کرد. سپس به کمک روش های آنالیز ماتریسی احتمال برشکستگی ، میزان مازاد در هنگام برشکستگی و میزان کسری بودجه در زمان وقوع برشکستگی را محاسبه کرده ایم. هدف ما در این پایان نامه بسیار محاسباتی و کاربردی تر از روش های است که در گذشته برای محاسبه این احتمال ارائه شده است. در ابتدا ما نشا...
15 صفحه اولHierarchical Hidden Markov Models for Information Extraction
An important problem in computational social choice concerns whether it is possible to prevent manipulation of voting rules by making it computationally intractable. To answer this, a key question is how frequently voting rules are manipulable. We [Xia and Conitzer, 2008] recently defined the class of generalized scoring rules (GSRs) and characterized the frequency of manipulability for such ru...
متن کاملBoundary Element Method Macromodels for 2-D Hierarchical Capacitance Extraction†
A 2-D hierarchical field solution method was recently introduced for capacitance extraction for VLSI interconnect modeling. In this paper, we present several extensions to the method including a Boundary Element Method (BEM) formulation for creating macromodels, which provides a better trade-off between accuracy and efficiency, as well as parameterized elements, which allow the analysis of grid...
متن کاملA Parallel Algorithm for Hierarchical Circuit Extraction
In ICCAD88, 89, we proposed efficient parallel algorithms to speed up the task of VLSI circuit extraction on distributed memory multiprocessors. The input to the algorithms is a flat description of the circuit, in terms of the rectangles in different layers. In this paper, we describe an algorithm that combines the benefits of hierarchical analysis and parallelism. The input is a hierarchical d...
متن کاملA Stochastic Algorithm Based on Fast Marching for Automatic Capacitance Extraction in Non-Manhattan Geometries
We present an algorithm for 2D and 3D capacitance analysis on multidielectric integrated circuits of arbitrary geometry. Our algorithm is stochastic in nature and as such fully parallellizable. It is intended to extract capacitance entries directly from a pixelized representation of the integrated circuit (IC), which can be produced from a SEM (scanning electron microscopy) image. Preprocessing...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Advanced Packaging
سال: 2010
ISSN: 1521-3323,1557-9980
DOI: 10.1109/tadvp.2010.2091504